Construction of tree automata from regular expressions
نویسندگان
چکیده
منابع مشابه
Construction of Tree Automata from Regular Expressions
Since recognizable tree languages are closed under the rational operations, every regular tree expression denotes a recognizable tree language. We provide an alternative proof to this fact that results in smaller tree automata. To this aim, we transfer Antimirov’s partial derivatives from regular word expressions to regular tree expressions. For an analysis of the size of the resulting automato...
متن کاملConstruction of fuzzy automata from fuzzy regular expressions
Li and Pedrycz [Y. M. Li, W. Pedrycz, Fuzzy finite automata and fuzzy regular expressions with membership values in lattice ordered monoids, Fuzzy Sets and Systems 156 (2005) 68–92] have proved fundamental results that provide different equivalentways to represent fuzzy languageswithmembership values in a lattice-orderedmonoid, and generalize the well-known results of the classical theory of fo...
متن کاملTop-Down Construction of Finite Automata from Regular Expressions
We consider the construction of finite automata from their corresponding regular expressions by a series of digraph-transformations along the expression’s structure. Each intermediate graph represents an extended finite automaton accepting the same language. The character of our construction allows a fine-grained analysis of the emerging automaton’s size, eventually leading to an optimality res...
متن کاملAn Optimal Construction of Finite Automata from Regular Expressions
We consider the construction of finite automata from their corresponding regular expressions by a series of digraph-transformations along the expression’s structure. Each intermediate graph represents an extended finite automaton accepting the same language. The character of our construction allows a fine-grained analysis of the emerging automaton’s size, eventually leading to an optimality res...
متن کاملAutomata Construction for Regular Expressions in Model Checking
Industrial temporal languages like PSL/Sugar and ForSpec have augmented the language with Regular Expressions (REs). An RE specification represents a sequence of Boolean events a model may or may not exhibit. A common way of using REs for specification is in a negative way: a not RE! property describes an undesirable behavior of the model. A not r! formula has the nature that it is sufficient t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 2011
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/2011107